Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. In this paper, a idirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction simultaneously. It is shown that the proposed BFA can reduce the average decoding delay by at least 50% compared to the unidirectional Fano algorithm (UFA). Due to the reduction in the variability of the computational effort by using bidirectional search, there is even higher decoding throughput improvement at low signal-to-noise ratio (SNR). For example at Eb/No=3dB, there is 300% throughput improvement by using the BFA decoding compared to the conventional UFA decoding. The proposed BFA decoding technique can be employed in very high throughput wireless communication systems with low hardware complexity and power consumption.
展开▼
机译：在顺序解码中已经采用了各种技术，例如双向搜索，以减少解码延迟。本文提出了一种方向性Fano算法（BFA），其中前向解码器（FD）和后向解码器（BD）同时在相反的方向上搜索。结果表明，与单向Fano算法（UFA）相比，提出的BFA可以将平均解码延迟至少降低50％。由于通过使用双向搜索减少了计算工作量的可变性，因此在低信噪比（SNR）的情况下甚至可以实现更高的解码吞吐量。例如，在Eb / No = 3dB时，与传统的UFA解码相比，使用BFA解码可提高300％的吞吐量。所提出的BFA解码技术可用于具有低硬件复杂度和功耗的超高吞吐量无线通信系统中。
展开▼
